Probabilistic Matching Pursuit for Compressive Sensing
نویسندگان
چکیده
Compressive sensing investigates the recovery of a signal that can be sparsely represented in an orthonormal basis or overcomplete dictionary given a small number of linear combinations of the signal. We present a novel matching pursuit algorithm that uses the measurements to probabilistically select a subset of bases that is likely to contain the true bases constituting the signal. The algorithm is successful in recovering the original signal in cases where deterministic matching pursuit algorithms fail. We also show that exact recovery is possible when the number of nonzero coefficients is upto one less than the number of measurements. This overturns a previously held assumption in compressive sensing research.
منابع مشابه
Sparse Recovery Algorithms: Sufficient Conditions in terms of Restricted Isometry Constants
We review three recovery algorithms used in Compressive Sensing for the reconstruction s-sparse vectors x ∈ CN from the mere knowledge of linear measurements y = Ax ∈ Cm, m < N. For each of the algorithms, we derive improved conditions on the restricted isometry constants of the measurement matrix A that guarantee the success of the reconstruction. These conditions are δ2s < 0.4652 for basis pu...
متن کاملComparison of threshold-based algorithms for sparse signal recovery
Intensively growing approach in signal processing and acquisition, the Compressive Sensing approach, allows sparse signals to be recovered from small number of randomly acquired signal coefficients. This paper analyses some of the commonly used threshold-based algorithms for sparse signal reconstruction. Signals satisfy the conditions required by the Compressive Sensing theory. The Orthogonal M...
متن کاملSensing Dictionary Construction for Orthogonal Matching Pursuit Algorithm in Compressive Sensing Sensing Dictionary Construction for Orthogonal Matching Pursuit Algorithm in Compressive Sensing
In compressive sensing, the fundamental problem is to reconstruct sparse signal from its nonadaptive insufficient linear measurement. Besides sparse signal reconstruction algorithms, measurement matrix or measurement dictionary plays an important part in sparse signal recovery. Orthogonal Matching Pursuit (OMP) algorithm, which is widely used in compressive sensing, is especially affected by me...
متن کاملWavelet Compressive Sampling Signal Reconstruction Using Upside-Down Tree Structure
This paper suggests an upside-down tree-based orthogonal matching pursuit UDT-OMP compressive sampling signal reconstruction method in wavelet domain. An upside-down tree for the wavelet coefficients of signal is constructed, and an improved version of orthogonal matching pursuit is presented. The proposed algorithm reconstructs compressive sampling signal by exploiting the upside-down tree str...
متن کاملA New Sparse Adaptive Channel Estimation Method Based on Compressive Sensing for FBMC/OQAM Transmission Network
The conventional channel estimation methods based on a preamble for filter bank multicarrier with offset quadrature amplitude modulation (FBMC/OQAM) systems in mobile-to-mobile sensor networks are inefficient. By utilizing the intrinsicsparsity of wireless channels, channel estimation is researched as a compressive sensing (CS) problem to improve the estimation performance. In this paper, an Ad...
متن کامل